<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="UTF-8">
  <meta http-equiv="X-UA-Compatible" content="IE=edge">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <title>Document</title>
</head>
<body>
  <script>
    let arr = [
      { id: "29", pid: "", name: "总裁办" },
      { id: "2c", pid: "", name: "财务部" },
      { id: "2d", pid: "2c", name: "财务核算部" },
      { id: "2f", pid: "2c", name: "薪资管理部" },
      { id: "d2", pid: "", name: "技术部" },
      { id: "d3", pid: "d2", name: "Java研发部" },
      { id: "d31", pid: "d3", name: "Java研发部333" },
      { id: "d33", pid: "d3", name: "Java研发部333" },
    ];
    // 方法一: 使用递归来实现平铺数据转换为树形结构
    function getTree(arr, pid) {
      function changeArr(pid) {
        const res = []
        arr.forEach(item => {
          if (item.pid === pid) {
            res.push(item)
            item.children = changeArr(item.id)
          }
        })
        return res
      }
      return changeArr(pid)
    }
    getTree(arr, '')

  </script>
</body>
</html>